A visual tracking algorithm by integrating rigid model and snakes
نویسندگان
چکیده
This paper presents a robust vision algorithm for tracking the boundary of an object with an arbitrary shape by using monocular image sequences. This method consists of a curve registration based optimization technique and a deformable contour model (”snakes”) for the global and the local motion estimations, respectively. By combining techniques, we overcome, among other problems, inaccurate estimate of motion parameters in the curve registration method (which apparently only occur when a rigid or a flexible object is tracked), and the “local position variation” of the deformable contour model, variations which are due to noisy images and/or complex backgrounds. The curve registration method uses an iterative algorithm to find the minimum normal distance between two curves, one before motion and the corresponding curve after it. Snakes overcome the limitation of the curve registration method, which suffers from the inaccuracy of motion models. We also propose an internal force, which increases local robustness of the deformable contour to background noise. By using the refined snakes’ control points, the global update of the previous curve is performed for the re-location of the registered curve. Additionally, we integrate the geometric invariant value of the boundary contour and the curve registration method to solve the occlusion problem in visual tracking. The proposed method is validated through experiments on real images.
منابع مشابه
Visual Tracking using Learning Histogram of Oriented Gradients by SVM on Mobile Robot
The intelligence of a mobile robot is highly dependent on its vision. The main objective of an intelligent mobile robot is in its ability to the online image processing, object detection, and especially visual tracking which is a complex task in stochastic environments. Tracking algorithms suffer from sequence challenges such as illumination variation, occlusion, and background clutter, so an a...
متن کاملاصلاح ردیاب انتقال متوسط برای ردگیری هدف با الگوی تابشی متغیر
The mean shift algorithm is one of the popular methods in visual tracking for non-rigid moving targets. Basically, it is able to locate repeatedly the central mode of a desirable target. Object representation in mean shift algorithm is based on its feature histogram within a non-oriented individual kernel mask. Truly, adjusting of the kernel scale is the most critical challenge in this method. ...
متن کاملAn Adaptive-Robust Control Approach for Trajectory Tracking of two 5 DOF Cooperating Robot Manipulators Moving a Rigid Payload
In this paper, a dual system consisting of two 5 DOF (RRRRR) robot manipulators is considered as a cooperative robotic system used to manipulate a rigid payload on a desired trajectory between two desired initial and end positions/orientations. The forward and inverse kinematic problems are first solved for the dual arm system. Then, dynamics of the system and the relations between forces/momen...
متن کاملOnline multiple people tracking-by-detection in crowded scenes
Multiple people detection and tracking is a challenging task in real-world crowded scenes. In this paper, we have presented an online multiple people tracking-by-detection approach with a single camera. We have detected objects with deformable part models and a visual background extractor. In the tracking phase we have used a combination of support vector machine (SVM) person-specific classifie...
متن کاملUsing a Novel Concept of Potential Pixel Energy for Object Tracking
Abstract In this paper, we propose a new method for kernel based object tracking which tracks the complete non rigid object. Definition the union image blob and mapping it to a new representation which we named as potential pixels matrix are the main part of tracking algorithm. The union image blob is constructed by expanding the previous object region based on the histogram feature. The pote...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996